A-posteriori probability decoding of variable-length codes using a three-dimensional trellis representation

نویسندگان

  • Jörg Kliewer
  • Ragnar Thobaben
چکیده

In this contribution we present an improved indexbased a-posteriori probability (APP) decoding approach for variable-length encoded packetized data, where implicit residual source correlation is exploited for error protection. The proposed algorithm is based on a novel generalized two-dimensional state representation which leads to a three-dimensional trellis with unique state transitions. APP decoding on this trellis is realized by employing a two-dimensional version of the classical BCJR algorithm. This new method has the advantage that due to the unique state representation all available a-priori information can be fully exploited, which especially holds for the transition probabilities of the Markov model associated with the variable-length encoded source indices. Simulation results for an additional error protection by channel codes and iterative joint source-channel decoding show that the proposed approach leads to an increased errorcorrection performance compared to previously published results where a one-dimensional state representation is used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbol-by-Symbol MAP Decoding of Variable Length Codes

In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...

متن کامل

Iterative Source/Channel-Decoding Using Reversible Variable Length Codes

In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of variable length codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer variable length code and an inner convolutional code. Due to ...

متن کامل

Joint Source and Channel Decoding for Variable Length Encoded Turbo Codes

Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy. Most previous publications on this subject focus on a traditional coding scheme in which the source variable-length coding (VLC) is serially concatenated with a channel code. In this paper, a parallel concatenated coding scheme fo...

متن کامل

Iterative Source-Channel Decoding for Robust Image Transmission

In this paper we investigate iterative source-channel decoding for robust JPEG coded images transmission over noisy channels. Huffman codes used as the variable-length coding scheme in JPEG coding can be represented by an irregular trellis structure proposed by Balakirsky (1997). State transition probabilities can be derived from the irregular trellis and can be used as a priori information to ...

متن کامل

Robust transmission of variable-length encoded sources

Digital communications systems commonly use compression (source coding) and error control (channel coding) to allow efficient and robust transmission of data over noisy channels. When compression is imperfect, some residual redundancy remains in the transmitted data and can be exploited at the decoder to improve the decoder’s probability-of-error performance. A new approach to joint source-chan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003